Constant time parallel sorting: an empirical view
نویسندگان
چکیده
Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embarked on an empirical study of most of the algorithms in the literature, including the non-constructive ones. This paper is an exposition of what we have found. One of our conclusions is that non-constructive algorithms can be useful. r 2003 Elsevier Science (USA). All rights reserved.
منابع مشابه
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting
Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take fl(log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more "wasteful" convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1 + o(1))n. We give very fast randomized CRCW PRAM algorit...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملCommunication-Efficient Parallel Sorting
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is O(*) and a number of communication rounds ...
متن کاملParallel Comparison Algorithms for Approximation Problems
Suppose we have n elements from a totally ordered domain, and we are allowed to perform p parallel comparisons in each time unit (round). In this paper we determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of Valiant, for all admissible values of n, p and e, where e is an accuracy parameter determining the quali...
متن کاملA 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
We investigate the problem of finding the twodimensional convex hull of a set of points on a coarsegrained parallel computer. Recently Goodrich has devised a parallel sorting algorithm for n items on P processors which achieves an optimal number of communication phases for all ranges of P n. Ferreira et al. have recently introduced a deterministic convex hull algorithm with a constant number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 67 شماره
صفحات -
تاریخ انتشار 2003